Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Homogeneous variable exponent Besov and Triebel–Lizorkin spaces

We introduce homogeneous Besov and Triebel–Lizorkin spaces with variable indexes. We show that their study reduces to the study of inhomogeneous variable exponent spaces and homogeneous constant exponent spaces. Corollaries include trace space characterizations and Sobolev embeddings.     

On the domain of fractional Laplacians and related generators of Feller processes

In this paper we study the domain of the generator of stable processes, stable-like processes and more general pseudo- and integro-differential operators which naturally arise both in analysis and as infinitesimal generators of Lévy- and Lévy-type (Feller) processes. In particular we obtain conditions on the symbol of the operator ensuring that certain (variable order) Hölder and Hölder–Zygmund spaces are in the domain. We use tools from probability theory to investigate the small-time asymptotics of the generalized moments of a Lévy or Lévy-type process ${(X_t)}_{t\ge 0}$,

$\underset{t\to 0}{\lim }?\frac{1}{t}({\mathbb{E}}^{x}f(X_t)?f(x)),x\in {\mathbb{R}}^d,$

for functions f which are not necessarily bounded or differentiable. The pointwise limit exists for fixed $x\in {\mathbb{R}}^d$ if f satisfies a Hölder condition at x. Moreover, we give sufficient conditions which ensure that the limit exists uniformly in the space of continuous functions vanishing at infinity. As an application we prove that the domain of the generator of ${(X_t)}_{t\ge 0}$ contains certain Hölder spaces of variable order. Our results apply, in particular, to stable-like processes, relativistic stable-like processes, solutions of Lévy-driven SDEs and Lévy processes.     

NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .     

Development and validation of an ultra‐high‐performance liquid chromatography–tandem mass spectrometry method to determine the bioavailability of warfarin and its major metabolite 7‐hydroxy warfarin in rats dosed with oral formulations containing different polymorphic forms

A simple, sensitive and rapid ultra‐high‐performance liquid chromatography–electrospray ionization–tandem mass spectrometry method was developed and validated for the quantification of warfarin and 7‐hydroxy warfarin in Sprague Dawley (SD) rats. Animals were administered a single dose of warfarin sodium formulations (crystalline and amorphous) at 12 mg/kg via oral gavage and blood was drawn over a 96‐h time course. Sample process recoveries, matrix effect and analyte stability were determined. The linearity for warfarin and 7‐hydroxy warfarin was from 5 to 2000 ng/mL in blank SD rat plasma. Correlation coefficients (r²) for standard calibration curves were >.98 and analytes quantified within ±15% of target at all calibrator concentrations. The average percent accuracy and precision for intra‐ and inter‐day were 93.7%–113.8% and ≤12.1%, respectively, for warfarin and 7‐hydroxy warfarin, across the quality control standards (5, 10, 500, 1800 and 2000 ng/mL). Acceptable analytical recovery (>55%) was achieved with process efficiencies >41.5% and matrix effects <139.9% over the analytical range. Both analytes were stable in stock solution, autosampler, benchtop and three cycles of freeze–thaw with percent accuracy ≥90.2% and precision (percent relative standard deviation) ≤14%. The validated method was successfully applied to a pre‐clinical bioavailability study of crystalline and amorphous warfarin sodium formulations in SD rats.     

DNA interaction,cytotoxicity and molecular structure of cobalt complex of 4‐amino‐N‐(6‐chloropyridazin‐3‐yl)benzene sulfonamide in the presence of secondary ligand pyridine

Novel cobalt complex of 4‐amino‐N‐(6‐chloropyridazin‐3‐yl)benzene sulfonamide (sulfachloropyridazine) has been synthesized and characterized by elemental analysis, FT‐IR spectroscopy and magnetic susceptibility (VSM). Cobalt complex of Sulfachloropyridazine (Co‐SCP) crystallized in monoclinic space group P2₁/n with Z = 4. The structure is solved by direct method and refined to R = 0.099 for 4720 reflections with I ?4σ(I). The results of FT‐IR spectra suggest the binding of cobalt atom to the sulfonamide ligand which is in agreement with the crystal structure determination. In crystal structure, molecule is linked via, C‐H … π, C‐Cl … π and π … π intermolecular interactions. The computational studies like the optimization energy and root means square deviation compare with single crystal structure, frontier molecular orbital (Homo‐Lumo energy) and binding energy of the Co‐SCP has been carried out using DFT/B3LYP level of theory in gaseous phase. Hirshfeld surfaces and the 2D‐fingerprint analysis are performed to study the nature of interactions and their measurable contributions towards crystal packing. The interaction of the complex with DNA is investigated using viscosity measurement and absorption titration studies. The result shows the complex bind to DNA with intercalative mode with high DNA‐binding constant (K_b). Also, in vivo and in vitro cytotoxic studies are performed using S. pombe cells and brine shrimp lethality bioassay. DNA‐cleavage study shows better cleaving ability of the complex.     

Weighted estimates for the multilinear maximal function on the upper half‐spaces

For a general dyadic grid, we give a Calderón–Zygmund type decomposition, which is the principle fact about the multilinear maximal function on the upper half‐spaces. Using the decomposition, we study the boundedness of . We obtain a natural extension to the multilinear setting of Muckenhoupt's weak‐type characterization. We also partially obtain characterizations of Muckenhoupt's strong‐type inequalities with one weight. Assuming the reverse Hölder's condition, we get a multilinear analogue of Sawyer's two weight theorem. Moreover, we also get Hytönen–Pérez type weighted estimates.     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

A dynamic free-entry oligopoly with sluggish entry and exit adjustments

We study a dynamic free-entry oligopoly with sluggish entry and exit of firms under general demand and cost functions. We show that the number of firms in a steady-state open-loop solution for a dynamic free-entry oligopoly is smaller than that at static equilibrium and that the number of firms in a steady-state memoryless closed-loop solution is larger than that in an open-loop solution.